Aggregation functions: Construction methods, conjunctive, disjunctive and mixed classes
نویسندگان
چکیده
In this second part of our state-of-the-art overview on aggregation theory, based again on our recent monograph on aggregation functions, we focus on several construction methods for aggregation functions and on special classes of aggregation functions, covering the well-known conjunctive, disjunctive, and mixed aggregation functions. Some fields of applications are included.
منابع مشابه
Parametric characterization of aggregation functions
The aim of this contribution is to find a common framework for parametric characterization of aggregation functions exploiting the notions of unipolar and bipolar parametric characterization, and also unify the ideas of global and local parametric characterization. We revise the known approaches to classification of aggregation functions in special classes in this framework, and also propose so...
متن کاملAggregation of Preferences in Recommender Systems
Aggregation of preferences, criteria or similarities happens at various stages in recommender systems. Typically such aggregation is done by using either the arithmetic mean or maximum/minimum functions. Many other aggregation functions which would deliver flexibility and adaptability towards more relevant recommendations are often overlooked. In this chapter we will review the basics of aggreg...
متن کاملGeneralised fuzzy aggregation in estimating the risk of desertification of a burned forest
This paper investigates two aspects of using Fuzzy Logic with a GIS: The use of non-conventional aggregation operators for conjunctive and disjunctive reasoning and the use of weights when combining aggregates of different significance to the classification. Two methods of weighting are used, weights as powers of the membership functions, and the novel concept of membership functions that take ...
متن کاملON THE FUZZY SET THEORY AND AGGREGATION FUNCTIONS: HISTORY AND SOME RECENT ADVANCES
Several fuzzy connectives, including those proposed by Lotfi Zadeh, can be seen as linear extensions of the Boolean connectives from the scale ${0,1}$ into the scale $[0,1]$. We discuss these extensions, in particular, we focus on the dualities arising from the Boolean dualities. These dualities allow to transfer the results from some particular class of extended Boolean functions, e.g., from c...
متن کاملTwo Classes of Boolean Functions for Dependency Analysis
Many static analyses for declarative programming/database languages use Boolean functions to express dependencies among variables or argument positions. Examples include groundness analysis, arguably the most important analysis for logic programs, finiteness analysis and functional dependency analysis for databases. We identify two classes of Boolean functions that have been used: positive and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Sci.
دوره 181 شماره
صفحات -
تاریخ انتشار 2011